Biconvex sets and optimization with biconvex functions: a survey and extensions
نویسندگان
چکیده
The problem of optimizing a biconvex function over a given (bi)convex or compact set frequently occurs in theory as well as in industrial applications, for example, in the field of multifacility location or medical image registration. Thereby, a function f : X×Y → R is called biconvex, if f(x, y) is convex in y for fixed x ∈ X, and f(x, y) is convex in x for fixed y ∈ Y . This paper presents a survey of existing results concerning the theory of biconvex sets and biconvex functions and gives some extensions. In particular, we focus on biconvex minimization problems and survey methods and algorithms for the constrained as well as for the unconstrained case. Furthermore, we state new theoretical results for the maximum of a biconvex function over biconvex sets.
منابع مشابه
Parameterizations of Infinite Biconvex Sets in Affine Root Systems
We investigate detailed relationships between the set W of all infinite “reduced” sequences of elements of a canonical generating set of an arbitrary affine Weyl group and the set B of all infinite sets having a certain “biconvex” property in a positive root system ∆+ of the corresponding untwisted affine Lie algebra g. The study is related to the classification of convex orders on ∆+, which ar...
متن کاملJointly Constrained Biconvex Programming
This paper presents a branch-and-bound algorithm for minimizing the sum of a convex function in x, a convex function in y and a bilinear term in x andy over a closed set. Such an objective function is called biconvex with biconcave functions similarly defined. The feasible region of this model permits joint constraints in x and y to be expressed. The bilinear programming problem becomes a speci...
متن کاملParametrizations of Infinite Biconvex Sets in Affine Root Systems
We investigate in detail relationships between the set B of all infinite “biconvex” sets in the positive root system ∆+ of an arbitrary untwisted affine Lie algebra g and the set W of all infinite “reduced word” of the Weyl group of g. The study is applied to the classification of “convex orders” on ∆+ (cf. [Ito]), which are indispensable to construct “convex bases” of PoincaréBirkhoff-Witt typ...
متن کاملBiconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
We formulate the problem of optimizing a convex function over the weakly e$cient set of a multicriteria a$ne fractional program as a special biconvex problem. We propose a decomposition algorithm for solving the latter problem. The proposed algorithm is a branch-and-bound procedure taking into account the a$ne fractionality of the criterion functions. c © 2001 Published by Elsevier Science B.V.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 66 شماره
صفحات -
تاریخ انتشار 2007